Rating and Generating Sudoku Puzzles

نویسندگان

  • Shanchen Pang
  • Eryan Li
  • Tao Song
  • Peng Zhang
چکیده

The Sudoku puzzle has achieved worldwide popularity recently, and attracted great attention of the computational intelligence community. How to evaluate the difficulty of the puzzle is a difficult thing. In this paper, the nondeterministic degree is regarded as the main factor that affects Sudoku puzzle and we get the difficulty through summing the entropy of each step. We give the difficulty level model by mapping the difficulty to integers. An algorithm is developed to generate Sudoku puzzles when given a difficulty level. KeywordsSudoku; Algorithm; Difficulty Level

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rating and Generating Sudoku Puzzles Based On Constraint Satisfaction Problems

Sudoku is a logic-based combinatorial puzzle game which people in different ages enjoy playing it. The challenging and addictive nature of this game has made it a ubiquitous game. Most magazines, newspapers, puzzle books, etc. publish lots of Sudoku puzzles every day. These puzzles often come in different levels of difficulty so that all people, from beginner to expert, can play the game and en...

متن کامل

Solving and Rating Sudokus using Constraint Satisfiability Approaches and Genetic Algorithms

Sudoku is a very simple and well-known puzzle that has achieved international popularity in the recent past. This project addresses the problem of encoding Sudoku puzzles into conjunctive normal form (CNF), and subsequently solving them using polynomial-time propositional satisfiability (SAT) inference techniques. We introduce two straightforward SAT encodings for Sudoku: the minimal encoding a...

متن کامل

New Developments in Artificial Intelligence and the Semantic Web

This paper discusses solving and generating Sudoku puzzles with evolutionary algorithms. Sudoku is a Japanese number puzzle game that has become a worldwide phenomenon. As an optimization problem Sudoku belongs to the group of combinatorial problems, but it is also a constraint satisfaction problem. The objective of this paper is to test if genetic algorithm optimization is an efficient method ...

متن کامل

Difficulty Rating of Sudoku Puzzles: An Overview and Evaluation

How can we predict the difficulty of a Sudoku puzzle? We give an overview of difficulty rating metrics and evaluate them on extensive dataset on human problem solving (more then 1700 Sudoku puzzles, hundreds of solvers). The best results are obtained using a computational model of human solving activity. Using the model we show that there are two sources of the problem difficulty: complexity of...

متن کامل

SudokuSat-A Tool for Analyzing Difficult Sudoku Puzzles

Sudoku puzzles enjoy world-wide popularity, and a large community of puzzlers is hoping for ever more difficult puzzles. A crucial step for generating difficult Sudoku puzzles is the fast assessment of the difficulty of a puzzle. In a study in 2006, it has been shown that SAT solving provides a way to efficiently differentiate between Sudoku puzzles according to their difficulty, by analyzing w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010